home *** CD-ROM | disk | FTP | other *** search
- Path: news3.digex.net!usenet
- From: jlp@apti.com (James L. Preston)
- Newsgroups: comp.lang.c++
- Subject: Symbol Table Implementation question
- Date: 07 Feb 1996 09:51:55 -0500
- Organization: Advanced Power Technologies, Inc.
- Sender: jlp@sandbox.apti.com
- Message-ID: <tug2cngpdg.fsf@sandbox.apti.com>
- NNTP-Posting-Host: apti.com
- X-Newsreader: Gnus v5.0.8
-
-
- Folks,
- Mostly I do scientific computing work and GUI development,
- so I haven't had the opportunity to do parsing, yacc type stuff with
- C++, templates, etc. But now I have the chance so I want to
- get off on the right foot. I am interested to know how some
- of you (J. Kanze for example) go about implementing a nice
- symbol table for your token lookups. I have seen some talk of
- a hash table template that may become part of STL, but it does not
- appear to be in the distribution that I have. I see that the
- set template can be used, but that would appear to be sub-optimal.
- Are people implementing hash tables as maps of vectors, or something
- like that ( I guess that you could make a map of sets if you wanted your
- hair to hurt)?
-
- Anyway, let me know what the best approach to developing a nice little
- grammar is or point me to some nice articles on the subject and I will
- be very grateful.
- ( I guess I remember a long thread about parsers on this group a while
- back, but it got pretty heated and I lost track of it.)
-
- thanks,
- jlp@apti.com
- (Jim Preston)
-